Corrigendum: Public‐key encryption indistinguishable under plaintext‐checkable attacks
نویسندگان
چکیده
منابع مشابه
Public-Key Encryption Indistinguishable Under Plaintext-Checkable Attacks
Indistinguishability under adaptive chosen-ciphertext attack (IND-CCA) is now considered the de facto security notion for public-key encryption. However, the security guarantee that it offers is sometimes stronger than what is needed by certain applications. In this paper, we consider a weaker notion of security for public-key encryption, termed indistinguishability under plaintextchecking atta...
متن کاملPublickey encryption by ordering
In 1999, public key cryptography using the matrix was devised by a hish school student of 16 yesrs old girl Sarah Flannery. This cryptosystem seemed faster than RSA, and it's having the strength to surpass even the encryption to RSA. However, this encryption scheme was broken bfore har papers were published. In this paper, We try to construct publickey encryption scheme from permutation group t...
متن کاملClassical Encryption and Authentication under Quantum Attacks
Post-quantum cryptography studies the security of classical, i.e. non-quantum cryptographic protocols against quantum attacks. Until recently, the considered adversaries were assumed to use quantum computers and behave like classical adversaries otherwise. A more conservative approach is to assume that also the communication between the honest parties and the adversary is (partly) quantum. We d...
متن کاملImage Encryption using Adaptive Pixel Masking under Various Noise Attacks
Cryptosystems have always had tremendous applications in the fields of data security. With ever growing applications of digital images, encryption of images has emerged as a highly sought after area of research. In this present paper, a novel adaptive pixel masking scheme has been introduced for image encryption. Since images undergo degradations while transmission as well as storage, an image ...
متن کاملPublic Key Encryption and Encryption Emulation Attacks
The main purpose of this paper is to show that public key encryption can be secure against the “encryption emulation” attack (on the sender’s encryption) by computationally unbounded adversary, with one reservation: a legitimate receiver decrypts correctly with probability that can be made arbitrarily close to 1, but not equal to 1. 1. Summary of our claims We thought it would make sense to sum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Information Security
سال: 2020
ISSN: 1751-8717,1751-8717
DOI: 10.1049/iet-ifs.2019.0200